In this work, we propose a communication-efficient two-layer federated learning algorithm for distributed setups including a core server and multiple edge servers with clusters of devices. Assuming different learning tasks, clusters with a same task collaborate. To implement the algorithm over wireless links, we propose a scalable clustered over-the-air aggregation scheme for the uplink with a bandwidth-limited broadcast scheme for the downlink that requires only two single resource blocks for each algorithm iteration, independent of the number of edge servers and devices. This setup is faced with interference of devices in the uplink and interference of edge servers in the downlink that are to be modeled rigorously. We first develop a spatial model for the setup by modeling devices as a Poisson cluster process over the edge servers and quantify uplink and downlink error terms due to the interference. Accordingly, we present a comprehensive mathematical approach to derive the convergence bound for the proposed algorithm including any number of collaborating clusters in the setup and provide important special cases and design remarks. Finally, we show that despite the interference in the proposed uplink and downlink schemes, the proposed algorithm achieves high learning accuracy for a variety of parameters.

通过增加无线设备的计算能力，以及用户和设备生成的数据的前所未有的级别，已经出现了新的分布式机器学习（ML）方法。在无线社区中，由于其通信效率及其处理非IID数据问题的能力，联邦学习（FL）特别有趣。可以通过称为空中计算（AIRCOMP）的无线通信方法加速FL训练，其利用同时上行链路传输的干扰以有效地聚合模型更新。但是，由于Aircomp利用模拟通信，因此它引入了不可避免的估计错误。在本文中，我们研究了这种估计误差对FL的收敛性的影响，并提出了一种改进资源受限无线网络的方法的转移。首先，我们通过静态通道重新传输获得最佳Aircomp电源控制方案。然后，我们调查了传递的空中流体的性能，并在流失函数上找到两个上限。最后，我们提出了一种选择最佳重传的启发式，可以在训练ML模型之前计算。数值结果表明，引入重传可能导致ML性能提高，而不会在通信或计算方面产生额外的成本。此外，我们为我们的启发式提供了模拟结果，表明它可以正确地确定不同无线网络设置和机器学习问题的最佳重传次数。

随着数据生成越来越多地在没有连接连接的设备上进行，因此与机器学习（ML）相关的流量将在无线网络中无处不在。许多研究表明，传统的无线协议高效或不可持续以支持ML，这创造了对新的无线通信方法的需求。在这项调查中，我们对最先进的无线方法进行了详尽的审查，这些方法是专门设计用于支持分布式数据集的ML服务的。当前，文献中有两个明确的主题，模拟的无线计算和针对ML优化的数字无线电资源管理。这项调查对这些方法进行了全面的介绍，回顾了最重要的作品，突出了开放问题并讨论了应用程序方案。

Cell-free multi-user multiple input multiple output networks are a promising alternative to classical cellular architectures, since they have the potential to provide uniform service quality and high resource utilisation over the entire coverage area of the network. To realise this potential, previous works have developed radio resource management mechanisms using various optimisation engines. In this work, we consider the problem of overall ergodic spectral efficiency maximisation in the context of uplink-downlink data power control in cell-free networks. To solve this problem in large networks, and to address convergence-time limitations, we apply scalable multi-objective Bayesian optimisation. Furthermore, we discuss how an intersection of multi-fidelity emulation and Bayesian optimisation can improve radio resource management in cell-free networks.

Dyadic and small group collaboration is an evolutionary advantageous behaviour and the need for such collaboration is a regular occurrence in day to day life. In this paper we estimate the perceived personality traits of individuals in dyadic and small groups over thin-slices of interaction on four multimodal datasets. We find that our transformer based predictive model performs similarly to human annotators tasked with predicting the perceived big-five personality traits of participants. Using this model we analyse the estimated perceived personality traits of individuals performing tasks in small groups and dyads. Permutation analysis shows that in the case of small groups undergoing collaborative tasks, the perceived personality of group members clusters, this is also observed for dyads in a collaborative problem solving task, but not in dyads under non-collaborative task settings. Additionally, we find that the group level average perceived personality traits provide a better predictor of group performance than the group level average self-reported personality traits.

Federated learning (FL) has emerged as an instance of distributed machine learning paradigm that avoids the transmission of data generated on the users' side. Although data are not transmitted, edge devices have to deal with limited communication bandwidths, data heterogeneity, and straggler effects due to the limited computational resources of users' devices. A prominent approach to overcome such difficulties is FedADMM, which is based on the classical two-operator consensus alternating direction method of multipliers (ADMM). The common assumption of FL algorithms, including FedADMM, is that they learn a global model using data only on the users' side and not on the edge server. However, in edge learning, the server is expected to be near the base station and have direct access to rich datasets. In this paper, we argue that leveraging the rich data on the edge server is much more beneficial than utilizing only user datasets. Specifically, we show that the mere application of FL with an additional virtual user node representing the data on the edge server is inefficient. We propose FedTOP-ADMM, which generalizes FedADMM and is based on a three-operator ADMM-type technique that exploits a smooth cost function on the edge server to learn a global model parallel to the edge devices. Our numerical experiments indicate that FedTOP-ADMM has substantial gain up to 33\% in communication efficiency to reach a desired test accuracy with respect to FedADMM, including a virtual user on the edge server.

神经网络几乎被广泛用于识别图像内容的任何任务。尽管已经为研究有效的网络架构，优化器和培训策略而付出了很多努力，但图像插值对神经网络性能的影响尚未得到很好的研究。此外，研究表明，神经网络通常对输入图像的微小变化敏感，从而导致其性能急剧下降。因此，我们建议在本文中使用关键点不可知的选择性网格到网格重采样（FSMR）来处理神经网络的输入数据。这种基于模型的插值方法已经表明，它能够用PSNR优于常见的插值方法。我们使用广泛的实验评估表明，根据网络体系结构和分类任务，FSMR在培训过程中的应用有助于学习过程。此外，我们表明在应用阶段使用FSMR是有益的。对于RESNET50和OXFLOWER17数据集，可以提高分类精度高达4.31个百分点。

知识表示和推理（KRR）系统表示知识作为事实和规则的集合。像数据库一样，KRR系统包含有关工业企业，科学和业务等人类活动领域的信息。 KRR可以代表复杂的概念和关系，它们可以以复杂的方式查询和操纵信息。不幸的是，指定必要的知识需要大多数领域专家没有的技能，而专业知识工程师很难找到，因此KRR技术受到了阻碍。一种解决方案可能是从英语文本中提取知识，并且许多作品都尝试这样做（Openseame，Google的吊索等）。不幸的是，目前，从不受限制的自然语言中提取逻辑事实仍然是不准确的，无法用于推理，而限制语言语法（所谓的受控自然语言或CNL）对于用户来说很难学习和使用。然而，与其他方法相比，一些最近基于CNL的方法，例如知识创作逻辑机（KALM）的精度非常高，并且一个自然的问题是可以在多大程度上取消CNL限制。在本文中，我们通过将KALM框架移植到神经自然语言解析器Mstanza来解决这个问题。在这里，我们将注意力限制在创作事实和查询上，因此我们的重点是我们所说的事实英语陈述。在我们的后续工作中将考虑创作其他类型的知识，例如规则。事实证明，基于神经网络的解析器有自己的问题，并且他们犯的错误范围从言论的一部分标记到lemmatization到依赖性错误。我们介绍了许多解决这些问题并测试新系统KALMFL（即，事实语言的KALM）的技术，这些技术表明KALMFL的正确性超过95％。

在图中找到最短路径与计算机视觉和图形中的许多问题相关，包括图像分割，形状匹配或离散表面上的测地距的计算。传统上，使用标量边缘权重的图表考虑了最短路径的概念，这使得可以通过添加各个边缘权重来计算路径的长度。然而，具有标量边缘权重的图对它们的表现率严重限制，因为通常使用边缘来编码更复杂的相互关系。在这项工作中，我们弥补了这种建模限制，并介绍了矩阵值边缘的图表中最短路径的新图形 - 理论概念。为此，我们定义了一种有意义的方式，用于量化矩阵值的边缘的路径长度，并且我们提出了一种简单但有效的算法来计算各个最短路径。虽然我们的形式主义是普遍的，因此适用于视野，图形及更远的各种环境，我们专注于在3D多种形式分析的背景下展示其优点。